probFD

python2.7 ../probfd-qcomp19/builds/release64/bin/translate/translate.py p01-c0-C0-g1-n5-domain.pddl p01-c0-C0-g1-n5-problem.pddl
../probfd-qcomp19/builds/release64/bin/downward --sas output.sas --engine fretpi-hdp --heuristic hmax --enable-caching --epsilon 1e-6

Parsing...
Parsing: [0.000s CPU, 0.003s wall-clock]
Normalizing task... [0.000s CPU, 0.000s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.000s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.000s CPU, 0.002s wall-clock]
Preparing model... [0.000s CPU, 0.001s wall-clock]
Generated 72 rules.
Computing model... [0.010s CPU, 0.009s wall-clock]
697 relevant atoms
725 auxiliary atoms
1422 final queue length
2460 total queue pushes
Completing instantiation... [0.020s CPU, 0.015s wall-clock]
Instantiating: [0.030s CPU, 0.027s wall-clock]
Computing fact groups...
Finding invariants...
10 initial candidates
Finding invariants: [0.000s CPU, 0.002s wall-clock]
Checking invariant weight... [0.000s CPU, 0.000s wall-clock]
Instantiating groups... [0.000s CPU, 0.000s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
6 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.000s CPU, 0.000s wall-clock]
Computing fact groups: [0.000s CPU, 0.003s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.000s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.000s CPU, 0.001s wall-clock]
Translating task: [0.020s CPU, 0.016s wall-clock]
235 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
5 propositions removed
Detecting unreachable propositions: [0.000s CPU, 0.005s wall-clock]
Reordering and filtering variables...
11 of 11 variables necessary.
1 of 6 mutex groups necessary.
385 of 385 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.000s CPU, 0.002s wall-clock]
Translator variables: 11
Translator derived variables: 0
Translator facts: 47
Translator goal facts: 7
Translator mutex groups: 1
Translator total mutex groups size: 6
Translator operators: 385
Translator axioms: 0
Translator task size: 2651
Translator peak memory: 22280 KB
Writing output... [0.000s CPU, 0.002s wall-clock]
Done! [0.060s CPU, 0.059s wall-clock]	

Warning: :types specification not allowed here (cf. PDDL BNF)	

reading input... [t=2.9113e-05s]
done reading input! [t=0.000487453s]
variables: 11
goals: 7
actions: 385
axioms: 0
has conditional effects: 0
reconstructing probabilistic actions... [t=0.000496691s]
done reconstructing probabilistic actions! [t=0.00100269s]
probabilistic actions: 260 (with 495 outcomes)
constructing successor generator... [t=0.00103405s]
done constructing successor generator! [t=0.00108308s]
Bytes per state: 4
Property: MaxProb
Preparing hmax dead end detection heuristic... [t=0.00109333s]
hmax initialization done! [t=0.00117688s]
Engine: FRET-pi with HDP
Starting trap elimination heuristic search wrapper...
Initial state reward: 1
Expansions: 295
Registered states: 454
Generated states: 1693
Cached transitions: 915
Expansion cache hits: 772
Transition cache hits: 25389
Approximate transition cache memory usage: 38KB
Solver time: 0.003957092000000000595s
Total time: 0.005145808999999999453s